Text Clustering in Distributed Networks with Enhanced File Security
نویسندگان
چکیده
منابع مشابه
Integrating Security in FreeLoader Distributed File System
FreeLoader is a high performance read-dominant distributed file system that utilizes free disk space on desktop workstations. The system is designed for maximum scalability and high connectivity by taking into account the write-once-readmany property of specific use cases. While still in the prototyping stage, FreeLoader security has not been addressed until recently. In this work we develop a ...
متن کاملIntra-file Security for a Distributed File System
Cryptographic file systems typically provide security by encrypting entire files or directories. This has the advantage of simplicity, but does not allow for fine-grained protection of data within very large files. This is not an issue in most general-purpose systems, but can be very important in scientific applications where some but not all of the output data is sensitive or classified. We pr...
متن کاملStrong Security for Distributed File Systems
We have developed a scheme to secure networkattached storage systems against many types of attacks. Our system uses strong cryptography to hide data from unauthorized users; someone gaining complete access to a disk cannot obtain any useful data from the system, and backups can be done without allowing the superuser access to unencrypted data. While denial-of-service attacks cannot be prevented...
متن کاملCluster Security with NVisionCC: The Forseti Distributed File Integrity Checker
Attackers who are able to compromise a single node in a high performance computing cluster can use that node as a launch point for a number of malicious actions. In many cases, the password used to log into a single node can be used to access a large number of nodes in the system, allowing the attacker to utilize the vast computing and storage capabilities of the compromised cluster to sniff ne...
متن کاملOptimal File Sharing in Distributed Networks
The following file distribution problem is considered: Given a network of processors represented by an undirected graph G = (V,E), and a file size k, an arbitrary file w of k bits is to be distributed among all nodes of G. To this end, each node is assigned a memory device such that, by accessing the memory of its own and of its adjacent nodes, the node can reconstruct the contents of w. The ob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOSR Journal of Computer Engineering
سال: 2014
ISSN: 2278-8727,2278-0661
DOI: 10.9790/0661-16582430